Stefan Wrobel
56 publications
15 venues
H Index 22
Affiliation
Fraunhofer Institute for Intelligent Analysis and Information Systems, Sankt Augustin, GermanyUniversity of Bonn, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Graph Filtration Kernels.
|
AAAI | 2022 | 0 |
| A generalized Weisfeiler-Lehman graph kernel.
|
MLJ | 2022 | 0 |
| Learning Weakly Convex Sets in Metric Spaces.
|
ECML/PKDD | 2021 | 3 |
| Adiabatic Quantum Computing for Max-Sum Diversification.
|
SDM | 2020 | 8 |
| HOPS: Probabilistic Subtree Mining for Small and Large Graphs.
|
KDD | 2020 | 3 |
| Maximum Margin Separations in Finite Closure Systems.
|
ECML/PKDD | 2020 | 4 |
| Effective approximation of parametrized closure systems over transactional data streams.
|
MLJ | 2020 | 0 |
| Leveraging Domain Knowledge for Reinforcement Learning Using MMC Architectures.
|
ICANN | 2019 | 13 |
| Probabilistic and exact frequent subtree mining in graphs beyond forests.
|
MLJ | 2019 | 5 |
| Maximal Closed Set and Half-Space Separations in Finite Closure Systems.
|
ECML/PKDD | 2019 | 8 |
| Probabilistic frequent subtrees for efficient graph classification and retrieval.
|
MLJ | 2018 | 5 |
| Policy Learning Using SPSA.
|
ICANN | 2018 | 4 |
| Mining Tree Patterns with Partially Injective Homomorphisms.
|
ECML/PKDD | 2018 | 4 |
| Efficient Decentralized Deep Learning by Dynamic Model Averaging.
|
ECML/PKDD | 2018 | 99 |
| Co-Regularised Support Vector Regression.
|
ECML/PKDD | 2017 | 1 |
| Using Echo State Networks for Cryptography.
|
ICANN | 2017 | 12 |
| Whole-body self-calibration via graph-optimization and automatic configuration selection.
|
ICRA | 2015 | 11 |
| On the Complexity of Frequent Subtree Mining in Very Simple Structures.
|
ILP | 2014 | 1 |
| Pedestrian Quantity Estimation with Trajectory Patterns.
|
ECML/PKDD | 2012 | 33 |
| Introduction to the special issue on mining and learning with graphs.
|
MLJ | 2011 | 1 |
| Frequent subgraph mining in outerplanar graphs.
|
DMKD | 2010 | 0 |
| A Logic-Based Approach to Relation Extraction from Texts.
|
ILP | 2009 | 19 |
| Efficient Discovery of Interesting Patterns Based on Strong Closedness.
|
SDM | 2009 | 28 |
| Tight Optimistic Estimates for Fast Subgroup Discovery.
|
ECML/PKDD | 2008 | 102 |
| Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract).
|
ECML/PKDD | 2007 | 0 |
| Bias-Free Hypothesis Evaluation in Multirelational Domains.
|
PAKDD | 2006 | 1 |
| Multi-class Ensemble-Based Active Learning.
|
ECML/PKDD | 2006 | 66 |
| Efficient co-regularised least squares regression.
|
ICML | 2006 | 175 |
| Frequent subgraph mining in outerplanar graphs.
|
KDD | 2006 | 110 |
| A comparative study on methods for reducing myopia of hill-climbing search in multirelational learning.
|
ICML | 2004 | 15 |
| Cyclic pattern kernels for predictive graph mining.
|
KDD | 2004 | 354 |
| Comparative Evaluation of Approaches to Propositionalization.
|
ILP | 2003 | 151 |
| Learning Minesweeper with Multirelational Learning.
|
IJCAI | 2003 | 19 |
| On Graph Kernels: Hardness Results and Efficient Alternatives.
|
COLT | 2003 | 922 |
| A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting.
|
ILP | 2003 | 6 |
| Scaling Boosting by Margin-Based Inclusionof Features and Relations.
|
ECML/PKDD | 2002 | 7 |
| Macro-Operators in Multirelational Learning: A Search-Space Reduction Technique.
|
ECML/PKDD | 2002 | 12 |
| A Scalable Constant-Memory Sampling Algorithm for Pattern Discovery in Large Databases.
|
ECML/PKDD | 2002 | 7 |
| Finding the Most Interesting Patterns in a Database Quickly by Using Sequential Sampling.
|
JMLR | 2002 | 0 |
| Transformation-Based Learning Using Multirelational Aggregation.
|
ILP | 2001 | 127 |
| Mining the Web with Active Hidden Markov Models.
|
ICDM | 2001 | 21 |
| Scalability, Search, and Sampling: From Smart Algorithms to Active Discovery.
|
ECML/PKDD | 2001 | 1 |
| Incremental Maximization of Non-Instance-Averaging Utility Functions with Applications to Knowledge Discovery Problems.
|
ICML | 2001 | 9 |
| Relational Learning Using Constrained Confidence-Rated Boosting.
|
ILP | 2001 | 28 |
| Relational Instance-Based Learning with Lists and Terms.
|
MLJ | 2001 | 89 |
| Scalability, Search, and Sampling: From Smart Algorithms to Active Discovery.
|
ECML/PKDD | 2001 | 0 |
| Extending K-Means Clustering to First-Order Representations.
|
ILP | 2000 | 44 |
| A sequential sampling algorithm for a general class of utility criteria.
|
KDD | 2000 | 25 |
| Application of Different Learning Methods to Hungarian Part-of-Speech Tagging.
|
ILP | 1999 | 27 |
| Relational Distance-Based Clustering.
|
ILP | 1998 | 97 |
| Term Comparisons in First-Order Similarity Measures.
|
ILP | 1998 | 35 |
| An Algorithm for Multi-relational Discovery of Subgroups.
|
ECML/PKDD | 1997 | 614 |
| Extensibility in Data Mining Systems.
|
KDD | 1996 | 58 |
| Concept Formation During Interactive Theory Revision.
|
MLJ | 1994 | 20 |
| On the Proper Definition of Minimality in Specialization and Theory Revision.
|
ECML/PKDD | 1993 | 41 |
| Towards a Model of Grounded Concept Formation.
|
IJCAI | 1991 | 22 |